Перевод: со всех языков на русский

с русского на все языки

exponential behavior

См. также в других словарях:

  • Exponential integral — is a mathematical function of a single argument which has no established notation.DefinitionsFor real values of x , the exponential integral Ei( x ) can be defined as : mbox{Ei}(x)=int { infty}^xfrac{e^t}t,dt., The definition above can be used… …   Wikipedia

  • Exponential decay — A quantity undergoing exponential decay. Larger decay constants make the quantity vanish much more rapidly. This plot shows decay for decay constants of 25, 5, 1, 1/5, and 1/25 for x from 0 to 5. A quantity is said to be subject to exponential… …   Wikipedia

  • exponential decay — noun a decrease that follows an exponential function • Syn: ↑exponential return • Hypernyms: ↑decay, ↑decline • Hyponyms: ↑relaxation, ↑relaxation behavior …   Useful english dictionary

  • exponential return — noun a decrease that follows an exponential function • Syn: ↑exponential decay • Hypernyms: ↑decay, ↑decline • Hyponyms: ↑relaxation, ↑relaxation behavior …   Useful english dictionary

  • Stretched exponential function — Figure 1. Illustration of a stretched exponential fit (with β=0.52) to an empirical master curve. For comparison, a least squares single and a double exponential fit are also shown. The data are rotational anisotropy of anthracene in… …   Wikipedia

  • Double exponential function — A double exponential function (red curve) compared to a single exponential function (blue curve). A double exponential function is a constant raised to the power of an exponential function. The general formula is , which grows much more quickly… …   Wikipedia

  • relaxation behavior — noun (physics) the exponential return of a system to equilibrium after a disturbance • Syn: ↑relaxation • Topics: ↑physics, ↑natural philosophy • Hypernyms: ↑exponential decay, ↑ …   Useful english dictionary

  • Pseudo-polynomial time — In computational complexity theory, a numeric algorithm runs in pseudo polynomial time if its running time is polynomial in the numeric value of the input (which is exponential in the length of the input its number of digits).An ExampleConsider… …   Wikipedia

  • Weakly NP-complete — In computational complexity, an NP complete (or NP hard) problem is weakly NP complete (or weakly NP hard), if there is an algorithm for the problem whose running time is polynomial in the dimension of the problem and the magnitudes of the data… …   Wikipedia

  • Double-clad fiber — Refractive index profile of dispersion compensating double clad fiber. c:core, i:inner cladding, o:outer cladding …   Wikipedia

  • Systems thinking — is a unique approach to problem solving in that it views certain problems as parts of an overall system, rather than focusing on individual outcomes and contributing to further development of the undesired element or problem. [O Connor, J.… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»